SEGMA: A Simulated Evolution Gate-Matrix Layout Algorithm
نویسندگان
چکیده
منابع مشابه
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) design, and can be described as a problem of assigning a set of circuit nodes (gates) in an optimal sequence, such that the layout area is minimized, as a consequence of optimizing the number of tracks necessary to cover ...
متن کاملVLSI design: gate matrix layout problem 18. VLSI design: gate matrix layout problem
With applications ranging from fields as distinct as fuzzy modeling (Xiong 2001), autonomous robot behavior (Luk et al. 2001), learning with backpropagation (Foo et al. 1999), and multicriteria optimization (Viennet et al. 1996), evolutionary methods have become an indispensable tool for systems scientists. Although already studied in the past, an interesting emerging issue is the use of multip...
متن کاملPerformance Aspects of Gate Matrix Layout
This paper introduces performance aspects as a new optimization criteria when generating Gate Matrix Layouts. A new layout model is presented that limits the amount o f parasitic capacitance in signal paths and the resistance in power supply lines. The performance considerations are combined with a new layout s-trate g y that improves circuit performance with little or no area penalty. A n Auto...
متن کاملGM Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques
In this paper, the gate matrix layout is formulated as a planning problem where a "plan" (the solution steps) is generated to achieve a "goal" (the gate matrix layout) that consists of subgoals interacting each other. Each subgoal corresponds to the placement of a gate to a slot. or to the routing of a net connecting gates. The interaction among subgoals is managed with two AI planning techniqu...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1994
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1994/80287